Periodically refreshed quantum thermal machines

نویسندگان

چکیده

We introduce unique class of cyclic quantum thermal machines (QTMs) which can maximize their performance at the finite value cycle duration $\tau$ where they are most irreversible. These QTMs based on single-stroke thermodynamic cycles realized by non-equilibrium steady state (NESS) so-called Periodically Refreshed Baths (PReB) process. find that such interpolate between standard collisional QTMs, consider repeated interactions with single-site environments, and autonomous operated simultaneous coupling to multiple macroscopic baths. discuss physical realization processes show implementation requires a number copies Interestingly, maximizing operating in irreversible point as function comes cost increasing complexity realizing regime, latter quantified increase baths required. demonstrate this physics considering simple example. also an elegant description PReB process for Gaussian systems terms discrete-time Lyapunov equation. Further, our analysis reveals interesting connections Zeno anti-Zeno effects.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Periodically refreshed multiply exposed photorefractive holograms.

We describe a method for increasing the diffraction efficiency of multiply exposed photorefractive holograms by periodic copying. The method is experimentally demonstrated with photorefractive and thermoplastic recording media.

متن کامل

Quasi-Periodically Driven Quantum Systems

Floquet theory provides rigorous foundations for the theory of periodically driven quantum systems. In the case of non-periodic driving, however, the situation is not so well understood. Here, we provide a critical review of the theoretical framework developed for quasi-periodically driven quantum systems. Although the theoretical footing is still under development, we argue that quasiperiodica...

متن کامل

The Smallest Thermal Machines

Are there limits to how small one can make a thermodynamic machine? At first sight, this question appears to contradict itself, as thermodynamics usually begins with a kind of macroscopic picture. However, as Nicolas Brunner at the University of Bristol, UK, and colleagues describe in a paper appearing in Physical Review E, this constraint can be circumvented, if one focuses on a special kind o...

متن کامل

Quantum Machines

We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on to machines that can perform a number of functions, with the function they perform being determined by a program, which is itself a quantum state. Examples of both deterministic and probabilistic programmable machines ...

متن کامل

Simulations of Quantum Turing Machines by Quantum Multi-Stack Machines

As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum

سال: 2022

ISSN: ['2521-327X']

DOI: https://doi.org/10.22331/q-2022-09-08-801